Mobile Data Collector Assignment and Scheduling for Minimizing Data Delay in Partitioned Wireless Sensor Networks

نویسندگان

  • Izzet F. Senturk
  • Kemal Akkaya
چکیده

Mobile Data Collectors (MDCs) can be employed to provide intermittent connectivity in partitioned Wireless Sensor Networks (WSNs). Typically, an MDC serves multiple partitions to collect their sensed data and relay it to the sink node if the sink is in one of the served partitions. If not, then the data needs to be passed to another MDC serving the sink partition at a certain rendezvous location. This causes an extra waiting time for the MDCs that reach the meeting points before others. In this paper, we propose a scheduling algorithm to reduce the rendezvous waiting delay based on the tour lengths. To completely eliminate this waiting delay, we also present a solution with multiple sinks. In this approach, the partitions of the WSN are clustered using p-center optimization and Voronoi cells. An MDC is then assigned for touring each cluster’s partitions. In this way, the dependency of MDCs to relay their data to other MDCs is eliminated and the tour lengths of MDCs are balanced which minimizes the end-to-end delay significantly.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

An Energy Efficient Clustering Method using Bat Algorithm and Mobile Sink in Wireless Sensor Networks

Wireless sensor networks (WSNs) consist of sensor nodes with limited energy. Energy efficiency is an important issue in WSNs as the sensor nodes are deployed in rugged and non-care areas and consume a lot of energy to send data to the central station or sink if they want to communicate directly with the sink. Recently, the IEEE 802.15.4 protocol is employed as a low-power, low-cost, and low rat...

متن کامل

A Secure Routing Algorithm for Underwater Wireless Sensor Networks

Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...

متن کامل

On delay-minimized data harvesting with mobile elements in wireless sensor networks

We consider the problem of routing and scheduling a set of mobile elements that act as mechanical carriers of data, harvesting them from sensor nodes and delivering them to a sink. The objective is to minimize the data delivery latency. Most of the existing work has focused on designing delay minimizing routes for the mobile nodes by leveraging variants of the Traveling Salesman Problem (TSP). ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013